Minimal factorizations of permutations into star transpositions
نویسندگان
چکیده
We give a compact expression for the number of factorizations of any permutation into a minimal number of transpositions of the form (1 i). Our result generalizes earlier work of Pak in which substantial restrictions were placed on the permutation being factored.
منابع مشابه
Factorizations of Permutations Into Star Transpositions
We give a compact expression for the number of factorizations of any permutation into a minimal number of transpositions of the form (1 i). Our result generalizes earlier work of Pak in which substantial restrictions were placed on the permutation being factored.
متن کاملInequivalent Transitive Factorizations into Transpositions
The question of counting minimal factorizations of permutations into transpositions that act transitively on a set has been studied extensively in the geometrical setting of ramified coverings of the sphere and in the algebraic setting of symmetric functions. It is natural, however, from a combinatorial point of view to ask how such results are affected by counting up to equivalence of factoriz...
متن کاملUnitary Matrix Integrals, Primitive Factorizations, and Jucys-Murphy Elements
A factorization of a permutation into transpositions is called “primitive” if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously studied factorization problems. Several formulas enumerating minimal primitive and possibly non-minimal primitive factorizations are presented, and interesting co...
متن کاملCombinatorial Constructions for Transitive Factorizations in the Symmetric Group
We consider the problem of counting transitive factorizations of permutations; that is, we study tuples (σr , . . . , σ1) of permutations on {1, . . . , n} such that (1) the product σr · · · σ1 is equal to a given target permutation π , and (2) the group generated by the factors σi acts transitively on {1, . . . , n}. This problem is widely known as the Hurwitz Enumeration Problem, since an enc...
متن کاملRefined Enumeration of Minimal Transitive Factorizations of Permutations
Minimal transitive cycle factorizations, parking functions and labeled trees are related very closely. Using the correspondences between them, we find a refined enumeration of minimal transitive factorizations of permutations of type (1, n− 1) and (2, n− 2).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009